Dynamic Steiner Tree Problem

This paper proposes a new problem, which we call the Dynamic Steiner Tree Problem. This is related to multipoint connection routing in communications networks, where the set of nodes to be connected changes over time. This problem can be divided into two cases, one in which rearrangement of existing routes is not allowed and a second in which rearrangement is allowed. In the first case, we show that there is no algorithm whose worst error ratio is less than 1/2 log n where n is the number of nodes to be connected. In the second case, we present an algorithm whose error rate is bounded by a constant and rearrangement is relatively small

On chip interconnects for multiprocessor turbo decoding architectures

International audienc

A Superstabilizing log⁡(n)\log(n)-Approximation Algorithm for Dynamic Steiner Trees

In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\log |S|$ times the cost of an optimal solution, where $S$ is the group of members. Our algorithm improves over existing solutions in several ways. First, it tolerates the dynamism of both the group members and the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is \emph{superstabilizing}. That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it keeps offering the Steiner tree service during the stabilization time to all members that have not been affected by this modification

Relaxing the Irrevocability Requirement for Online Graph Algorithms

Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request can be accepted at a later point, but any acceptance is irrevocable. Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption). Finally, we consider the Late Accept/Reject model, where late accepts and rejects are both allowed, but any late reject is irrevocable. For Independent Set, the Late Accept/Reject model is necessary to obtain a constant competitive ratio, but for Vertex Cover the Late Accept model is sufficient and for Minimum Spanning Forest the Late Reject model is sufficient. The Matching problem has a competitive ratio of 2, but in the Late Accept/Reject model, its competitive ratio is 3/2

Pushing the online matrix-vector conjecture off-line and identifying its easy cases

© Springer Nature Switzerland AG 2019. Henzinger et al. posed the so called Online Boolean Matrix-vector Multiplication (OMv) conjecture and showed that it implies tight hardness results for several basic partially dynamic or dynamic problems [STOC’15]. We show that the OMv conjecture is implied by a simple off-line conjecture. If a not uniform (i.e., it might be different for different matrices) polynomial-time preprocessing of the matrix in the OMv conjecture is allowed then we can show such a variant of the OMv conjecture to be equivalent to our off-line conjecture. On the other hand, we show that the OMV conjecture does not hold in the restricted cases when the rows of the matrix or the input vectors are clustered

Improving Network-on-Chip-based Turbo Decoder Architectures

In this work novel results concerning Networkon- Chip-based turbo decoder architectures are presented. Stemming from previous publications, this work concentrates first on improving the throughput by exploiting adaptive-bandwidth-reduction techniques. This technique shows in the best case an improvement of more than 60 Mb/s. Moreover, it is known that double-binary turbo decoders require higher area than binary ones. This characteristic has the negative effect of increasing the data width of the network nodes. Thus, the second contribution of this work is to reduce the network complexity to support doublebinary codes, by exploiting bit-level and pseudo-floatingpoint representation of the extrinsic information. These two techniques allow for an area reduction of up to more than the 40 % with a performance degradation of about 0.2 d

Mechanism of action of probiotics

The modern diet doesn't provide the required amount of beneficial bacteria. Maintenance of a proper microbial ecology in the host is the main criteria to be met for a healthy growth. Probiotics are one such alternative that are supplemented to the host where by and large species of Lactobacillus, Bifidobacterium and Saccharomyces are considered as main probiotics. The field of probiotics has made stupendous strides though there is no major break through in the identification of their mechanism of action. They exert their activity primarily by strengthening the intestinal barrier and immunomodulation. The main objective of the study was to provide a deep insight into the effect of probiotics against the diseases, their applications and proposed mechanism of action

Gold(I)-Catalyzed Coupling Reactions for the Synthesis of Diverse Small Molecules Using the Build/Couple/Pair Strategy

The build/couple/pair strategy has yielded small molecules with stereochemical and skeletal diversity by using short reaction sequences. Subsequent screening has shown that these compounds can achieve biological tasks considered challenging if not impossible (‘undruggable’) for small molecules. We have developed gold(I)-catalyzed cascade reactions of easily prepared propargyl propiolates as a means to achieve effective intermolecular coupling reactions for this strategy. Sequential alkyne activation of propargyl propiolates by a cationic gold(I) catalyst yields an oxocarbenium ion that we previously showed is trapped by C-based nucleophiles at an extrannular site to yield α-pyrones. Here, we report O-based nucleophiles react by ring opening to afford a novel polyfunctional product. In addition, by coupling suitable building blocks, we subsequently performed intramolecular pairing reactions that yield diverse and complex skeletons. These pairing reactions include one based on a novel aza-Wittig-6π-electrocyclization sequence and others based on ring-closing metathesis reactions.Chemistry and Chemical Biolog